Algorithms for Building Consensus MUL-trees
نویسندگان
چکیده
A MUL-tree is a generalization of a phylogenetic tree that allows the same leaf label to be used many times. Lott et al. [9,10] recently introduced the problem of inferring a so-called consensus MUL-tree from a set of conflicting MUL-trees and gave an exponential-time algorithm for a special greedy variant. Here, we study strict and majority rule consensus MUL-trees, and present the first ever polynomial-time algorithms for building a consensus MUL-tree. We give a simple, fast algorithm for building a strict consensus MUL-tree. We also show that although it is NP-hard to find a majority rule consensus MUL-tree, the variant which we call the singular majority rule consensus MUL-tree is unique and can be constructed efficiently.
منابع مشابه
Polynomial-Time Algorithms for Building a Consensus MUL-Tree
A multi-labeled phylogenetic tree, or MUL-tree, is a generalization of a phylogenetic tree that allows each leaf label to be used many times. MUL-trees have applications in biogeography, the study of host-parasite cospeciation, gene evolution studies, and computer science. Here, we consider the problem of inferring a consensus MUL-tree that summarizes a given set of conflicting MUL-trees, and p...
متن کاملBuilding species trees from larger parts of phylogenomic databases
Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of some labels, i.e., species. Inferring a species tree from a set of multi-labeled gene trees (MUL trees) is a wellknown problem in computational biology. We propose a novel approach to tackle this problem, mainly to transform a col...
متن کاملFrom Gene Trees to Species Trees through a Supertree Approach
Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of some labels, i.e. species. Inferring a species tree from a set of multi-labeled gene trees (MUL trees) is a wellknown problem in computational biology. We propose a novel approach to tackle this problem, mainly to transform a coll...
متن کاملBuilding Consensus with Balanced Splits
Given the multitude of sources for reconstructing the evolutionary history between entities, phylogenetic reconstruction methods often provide several trees classifying these entities. A key step in reconciling the different trees is to construct a consensus view of the history. If we consider each tree as a collection of laminar splits (two-way partitions), the primary problem in arriving at a...
متن کاملThe Asymmetric Median Tree - A New model for Building Consensus Trees
Inferring the consensus of a set of different evolutionary trees for a given species set is a well-studied problem, for which several different models have been proposed. In this paper, we propose a new optimization problem for consensus tree construction, which we call the asymmetric median tree, (AMT). Our main theoretical result is the equivalence between the asymmetric median tree problem o...
متن کامل